Showing items 1 - 17 of 17

Your selections:

Convex analysis in groups and semigroups: a sampler

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

On the augmented Lagrangian dual for integer programming

Applications of convex analysis within mathematics

Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations

Clique-based facets for the precedence constrained knapsack problem

Symbolic Fenchel conjugation

An outer approximate subdifferential method for piecewise affine optimization

Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization

A dual-active-set algorithm for positive semi-definite quadratic programming

  • Creator: Boland, N. L.
  • Resource Type: journal article
  • Date: 1997

On the failure of maximum entropy reconstruction for Fredholm equations and other infinite systems

Partially finite convex programming, part I: quasi relative interiors and duality theory

Partially finite convex programming, part II: explicit lattice models

A simple constraint qualification in infinite dimensional programming

On Fan's minimax theorem

Two kinds of normality in vector optimization

  • 1
  • Disclaimer
  • Privacy
  • Copyright
  • Contact
  • Deposit